Chromatic polynomials and network reliability

AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. The new polynomial, determined by a graph G and a subset K of points of G, coincides with the classical chromatic polynomial when K is the set of all points of G. The main theorems in the present paper include analogues of the standard axiomatic characterization and Whitney's topological characterizations of the chromatic polynomial, and the theorem of Stanley relating the chromatic polynomial to the number of acylic of G. The work in this paper was stimulated by important connections between the chromatic polynomial and the all-terminal network reliability problem, and by recent work of Boesch, Satyanarayana, and Suffel on a graph invariant related to the K-terminal reliability problem. Several of the Boesch, Satyanarayana, and Suffel are derived as corollaries to the main theorems of the present paper

An architecture for reliable distributed computer-controlled systems

In Distributed Computer-Controlled Systems (DCCS), both real-time and reliability requirements are of major concern. Architectures for DCCS must be designed considering the integration of processing nodes and the underlying communication infrastructure. Such integration must be provided by appropriate software support services. In this paper, an architecture for DCCS is presented, its structure is outlined, and the services provided by the support software are presented. These are considered in order to guarantee the real-time and reliability requirements placed by current and future systems

Solving the Task Variant Allocation Problem in Distributed Robotics

We consider the problem of assigning software processes (or tasks) to hardware processors in distributed robotics environments. We introduce the notion of a task variant, which supports the adaptation of software to specific hardware configurations. Task variants facilitate the trade-off of functional quality versus the requisite capacity and type of target execution processors. We formalise the problem of assigning task variants to processors as a mathematical model that incorporates typical constraints found in robotics applications; the model is a constrained form of a multi-objective, multi-dimensional, multiple-choice knapsack problem. We propose and evaluate three different solution methods to the problem: constraint programming, a constructive greedy heuristic and a local search metaheuristic. Furthermore, we demonstrate the use of task variants in a real instance of a distributed interactive multi-agent navigation system, showing that our best solution method (constraint programming) improves the system’s quality of service, as compared to the local search metaheuristic, the greedy heuristic and a randomised solution, by an average of 16, 31 and 56% respectively

Designer receptors show role for ventral pallidum input to ventral tegmental area in cocaine seeking.

The ventral pallidum is centrally positioned within mesocorticolimbic reward circuits, and its dense projection to the ventral tegmental area (VTA) regulates neuronal activity there. However, the ventral pallidum is a heterogeneous structure, and how this complexity affects its role within wider reward circuits is unclear. We found that projections to VTA from the rostral ventral pallidum (RVP), but not the caudal ventral pallidum (CVP), were robustly Fos activated during cue-induced reinstatement of cocaine seeking--a rat model of relapse in addiction. Moreover, designer receptor-mediated transient inactivation of RVP neurons, their terminals in VTA or functional connectivity between RVP and VTA dopamine neurons blocked the ability of drug-associated cues (but not a cocaine prime) to reinstate cocaine seeking. In contrast, CVP neuronal inhibition blocked cocaine-primed, but not cue-induced, reinstatement. This double dissociation in ventral pallidum subregional roles in drug seeking is likely to be important for understanding the mesocorticolimbic circuits underlying reward seeking and addiction

Exploring Web-Based University Policy Statements on Plagiarism by Research-Intensive Higher Education Institutions

Plagiarism may distress universities in the US, but there is little agreement as to exactly what constitutes plagiarism. While there is ample research on plagiarism, there is scant literature on the content of university policies regarding it. Using a systematic sample, we qualitatively analyzed 20 Carnegie-classified universities that are “Very High in Research.” This included 15 public state universities and five high-profile private universities. We uncovered highly varied and even contradictory policies at these institutions. Notable policy variations existed for verbatim plagiarism, intentional plagiarism and unauthorized student collaboration at the studied institutions. We conclude by advising that the American Association of University Professors (AAUP), the American Association of Colleges and Universities (AACU) and others confer and come to accord on the disposition of these issues